PARSE TREE VISUALIZATION FOR MALAY SENTENCE (BMTutor)
نویسندگان
چکیده
In Malaysia, various efforts have been made by the government and language researchers in improving student’s ability of mastering Malay language (BM) due to their poor ability in grammar and sentence structure. In terms of technology, to date, there is no computer software or a prototype that is available that can help students in learning the BM sentence structure. Thus, BMTutor is introduced as a solution to this problem. BMTutor is a prototype for visualizing Malay sentence combined with sentence checker, sentence correction and word attribute components. BMTutor is intended to facilitate the learning process of sentence construction and grammatical structure in BM. It is also to enhance the learning process in BM that can be used by communities, especially students. An algorithm in designing BMTutor is discussed in this paper. The algorithm of the software is done sequentially as followed: 1) tokenizing 2) checking the number of words, 3) searching and comparing process to check the spelling or conjunctions, 4) assigning each word with a certain word class, 5) matching with rules, and 6) delivering/producing output (sentence correction or parse tree visualization, word attribute components, and parse tree from sentence examples). Based on the testing conducted, output from the development process shows that the prototype can correct all 15 invalid sentences and can produce parse tree visualization for all 20 sentences.
منابع مشابه
Example-Based Machine Translation Based on the Synchronous SSTC Annotation Schema
In this paper, we describe an Example-Based Machine Translation (EBMT) system for EnglishMalay translation. Our approach is an examplebased approach which relies sorely on example translations kept in a Bilingual Knowledge Bank (BKB). In our approach, a flexible annotation schema called Structured String-Tree Correspondence (SSTC) is used to annotate both the source and target sentences of a tr...
متن کاملAn Incremental LL(1) Parsing Algorithm
Given a parse tree for a sentence xzy and a string Z, an incremental parser builds the parse tree for the sentence xZy by reusing as much of the parse tree for xzy as possible. The incremental LL(1) parsing algorithm in this paper makes use of a break-point table to identify reusable subtrees of the original parse tree in building the new parse tree. The break-point table may be computed from t...
متن کاملSentence Compression by Removing Recursive Structure from Parse Tree
Sentence compression is a task of generating a grammatical short sentence from an original sentence, retaining the most important information. The existing methods of removing the constituents in the parse tree of an original sentence cannot deal with recursive structures which appear in the parse tree. This paper proposes a method to remove such structure and generate a grammatical short sente...
متن کاملEecient Disambiguation by Means of Stochastic Tree Substitution Grammars
In Stochastic Tree Substitution Grammars (STSGs), one parse(tree) of an input sentence can be generated by exponentially many derivations ; the probability of a parse is deened as the sum of the probabilities of its derivations. As a result, some methods of Stochastic Context-Free Grammars (SCFGs), e.g. the Viterbi algorithm for nding the most probable parse (MPP) of an input sentence, are not ...
متن کاملDo latent tree learning models identify meaningful structure in sentences?
Recent work on the problem of latent tree learning has made it possible to train neural networks that learn to both parse a sentence and use the resulting parse to interpret the sentence, all without exposure to groundtruth parse trees at training time. Surprisingly, these models often perform better at sentence understanding tasks thanmodels that use parse trees from conventional parsers. This...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015